Search results for "Polynomial approximation"

showing 3 items of 3 documents

A PSO algorithm for designing 3d highway alignments adopting polynomial solutions

2017

Intelligent optimization algorithms for highway alignments have produced good results so far. However, considering the numerous constraints and factors directly implied in the infrastructure design, the researchers' efforts usually focus only on simplifying the alignment choice, supporting engineers in the design phase. Implementing strategic considerations regarding comfort and safety would be also very important. In this paper, the authors propose a method for designing improved 3D highway alignments using a specific optimization algorithm, based on a Swarm Intelligence technique, adopting an innovative polynomial transition curve as the unique horizontal curvature element, called PPC (Po…

OptimizationArtificial intelligenceDesignPolynomial approximationPSO3D highway alignmentCurve fittingSettore ICAR/04 - Strade Ferrovie Ed AeroportiAlignment Artificial intelligence Curve fitting Design Optimization Polynomial approximationtransition curveAlignment
researchProduct

Greedy and K-Greedy algoritmhs for multidimensional data association

2011

[EN] The multidimensional assignment (MDA) problem is a combinatorial optimization problem arising in many applications, for instance multitarget tracking (MTT). The objective of an MDA problem of dimension $d\in\Bbb{N}$ is to match groups of $d$ objects in such a way that each measurement is associated with at most one track and each track is associated with at most one measurement from each list, optimizing a certain objective function. It is well known that the MDA problem is NP-hard for $d\geq3$. In this paper five new polynomial time heuristics to solve the MDA problem arising in MTT are presented. They are all based on the semi-greedy approach introduced in earlier research. Experimen…

OptimizationMathematical optimizationCombinatorial optimizationPolynomial approximationESTADISTICA E INVESTIGACION OPERATIVAAerospace EngineeringApproximation algorithmNP-hardSensor fusionDimension (vector space)Combinatorial optimization problemsMulti-target trackingPolynomial time heuristicsCombinatorial optimizationAlgorithm designElectrical and Electronic EngineeringMultidimensional assignmentObjective functionsHeuristicsGreedy algorithmTime complexityAlgorithmMultidimensional dataAlgorithmsMathematics
researchProduct

Triangular Bézier Approximations to Constant Mean Curvature Surfaces

2008

We give a method to generate polynomial approximations to constant mean curvature surfaces with prescribed boundary. We address this problem by finding triangular Bezier extremals of the CMC-functional among all polynomial surfaces with a prescribed boundary. Moreover, we analyze the $\mathcal{C}^1$ problem, we give a procedure to obtain solutions once the tangent planes for the boundary curves are also given.

PolynomialMean curvaturePolynomial approximationsMathematical analysisTangent spaceBoundary (topology)TangentBézier curveMathematics::Differential GeometryConstant (mathematics)Mathematics
researchProduct